Computing minimal and maximal suffixes of a substring
نویسندگان
چکیده
منابع مشابه
Computing minimal and maximal suffixes of a substring
We consider the problems of computing the maximal and the minimal non-empty suffixes of substrings of a longer text of length n. For the minimal suffix problem we show that for every τ , 1 ≤ τ ≤ log n, there exists a linear-space data structure with O(τ) query time and O(n log n/τ) preprocessing time. As a sample application, we show that this data structure can be used to compute the Lyndon de...
متن کاملComputing Minimal and Maximal Suffixes of a Substring Revisited
We revisit the problems of computing the maximal and the minimal non-empty suffixes of a substring of a longer text of length n, introduced by Babenko, Kolesnichenko and Starikovskaya [CPM’13]. For the minimal suffix problem we show that for any 1 ≤ τ ≤ logn there exists a linear-space data structure with O(τ) query time and O(n logn/τ) preprocessing time. As a sample application, we show that ...
متن کاملMAXIMAL ALLOCATED BENEFIT AND MINIMAL ALLOCATED COST AND ITS APPLICATION
In this paper, we investigate the problems of consensus-making among institution in stock exchange with multiple criteria for evaluating performance when the players (institutions) are supposed to be egoistic and the score for each criterion for a player is supposed to be a positive score. Each player sticks to his superiority regarding the criteria. This paper introduces the models for computi...
متن کاملMinimal Suffix and Rotation of a Substring in Optimal Time
For a text of length n given in advance, the substring minimal suffix queries ask to determine the lexicographically minimal non-empty suffix of a substring specified by the location of its occurrence in the text. We develop a data structure answering such queries optimally: in constant time after linear-time preprocessing. This improves upon the results of Babenko et al. (CPM 2014), whose trad...
متن کاملMaximal Repeats Enhance Substring-based Authorship Attribution
This article tackles the Authorship Attribution task according to the language independence issue. We propose an alternative of variable length character n-grams features in supervised methods: maximal repeats in strings. When character ngrams are by essence redundant, maximal repeats are a condensed way to represent any substring of a corpus. Our experiments show that the redundant aspect of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.08.023